Solving the p-second center problem with variable neighborhood search

The p-center problem is a well-known and highly studied pertaining to the identification of p potential n center locations in such way as minimize maximum distance between users closest center. As opposed p-center, p-second minimizes sum distances from second centers. In this paper, we propose new Variable Neighborhood Search based algorithm for solving problem. Its performance assessed on benchmark instances literature. Moreover, further evaluate algorithm?s performance, generated larger with 1000, 1500, 2000, 2500 nodes defined over graphs up 1000 different densities. obtained results clearly demonstrate effectiveness efficiency proposed algorithm.